Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
801	A Multivariate Complexity Analysis of Lobbying in Multiple Referenda Robert Bredereck∗ , Jiehua Chen† , Sepp Hartung, Rolf Niedermeier and Ondˇrej Such´y‡ Stefan Kratsch Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2012-05-07 11:13:53 Complexity classes Parameterized complexity Mathematical optimization Matrix Kernelization NP Rank 2-satisfiability Theoretical computer science Computational complexity theory Applied mathematics
802	An abridged version of this paper appears in Proceedings of the 37th Symposium on Foundations of Computer Science, IEEE, 1996. Pseudorandom Functions Revisited: The Cascade Construction and its Concrete Security Mihir Be Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2005-10-31 17:44:37 Applied mathematics Algorithmic information theory Pseudorandom generator Computational complexity theory Pseudorandom function family One-way function Advantage Negligible function Function Cryptography Theoretical computer science Pseudorandomness
803	Online Amnesic Approximation of Streaming Time Series Themistoklis Palpanas University of California, Riverside Michail Vlachos Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2003-12-20 03:52:30 Numerical analysis Computational complexity theory Digital signal processing Algorithm Mathematical logic Time complexity Priority queue Piecewise linear function Approximation Theoretical computer science Applied mathematics Mathematical analysis
804	Monday, July 17 9:30-10:30 G¨ odel and Computations, Pavel Pudlak 10:30-11:00 Coffee 11:00-11:30 Polynomial Identity Testing for Depth 3 Circuits, Neeraj Kayal, Nitin Saxena Add to Reading List Source URL: computationalcomplexity.org Language: English - Date: 2012-07-28 21:08:59 Complexity classes Quantum complexity theory Russell Impagliazzo Circuit complexity PP PH Arthur–Merlin protocol Low Advice Theoretical computer science Computational complexity theory Applied mathematics
805	Probabilistic System-on-a-Chip Architectures LAKSHMI N. CHAKRAPANI, PINAR KORKMAZ, BILGE E. S. AKGUL, and KRISHNA V. PALEM Georgia Institute of Technology Parameter variations, noise susceptibility, and increasing energ Add to Reading List Source URL: www.ece.rice.edu Language: English - Date: 2012-08-15 21:59:31 Integrated circuits Digital electronics Electronic design Logic families PSoC Probabilistic complexity theory Randomized algorithm Probabilistic design Algorithm Theoretical computer science Computational complexity theory Electronic engineering
806	PRIMES is in P Manindra Agrawal Neeraj Kayal ∗ Nitin Saxena Department of Computer Science & Engineering Add to Reading List Source URL: math.ucr.edu Language: English - Date: 2006-05-09 13:08:50 Primality tests Analytic number theory Finite fields Analysis of algorithms Computational complexity theory AKS primality test Prime number Randomized algorithm Time complexity Mathematics Abstract algebra Theoretical computer science
807	Graph Sparsification via Refinement Sampling Ashish Goel∗ Michael Kapralov† Sanjeev Khanna‡ Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:50 Graph connectivity Spanning tree Analysis of algorithms Combinatorial optimization Connected component SL Connectivity Matching K-edge-connected graph Theoretical computer science Graph theory Computational complexity theory
808	sigmodrecord-schweikardt.dvi Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2009-07-31 12:29:47 Analysis of algorithms Time complexity Randomized algorithm Sorting algorithm Algorithm L Merge sort Worst-case complexity Element distinctness problem Theoretical computer science Applied mathematics Computational complexity theory
809	FAST IMPLEMENTATION OF WATERFALL BASED ON GRAPHS B. Marcotegui and S. Beucher Centre de Morphologie Mathématique. Ecole des Mines de Paris Add to Reading List Source URL: cmm.ensmp.fr Language: English - Date: 2010-05-17 04:16:56 Mathematics Computational complexity theory Mathematical morphology Watershed Segmentation Minimum spanning tree Computer vision Minimum spanning tree-based segmentation Segmentation-based object categorization Spanning tree Image processing Theoretical computer science
810	A new security proof for Damg˚ ard’s ElGamal Kristian Gjøsteen March 17, 2005 Abstract Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2005-03-17 15:37:01 Finite fields Computational complexity theory Diffie–Hellman problem ElGamal encryption Universal hashing Paillier cryptosystem Diffie–Hellman key exchange Cramer–Shoup cryptosystem Index of cryptography articles Cryptography Cryptographic protocols Public-key cryptography

UPDATE